SIC-testability of sequential logic controllers
نویسندگان
چکیده
منابع مشابه
A rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملDesign for testability of Reversible Logic Circuits
In modern technologies, management of energy loss is an important issue in digital logic design for both the manufacturer and the customer. A part of energy dissipation may occur because of nonideality of switches or devices. With the exponential growth of packing density, the traditional technologies like CMOS are reaching to a limit. So some alternative technology is required to overcome from...
متن کاملSequential design of decentralized controllers
Abst rac t -A procedure for sequential design of decentralized controllers for linear systems is presented. It is shown how to include a simple estimate of the effect of closing subsequent loops into the design problem for the loop which is to be closed. In the examples the robust performance in terms of the structured singular value is used as the measure of control performance, but the proced...
متن کاملTestability of SPP Three-Level Logic Networks
Sum of Pseudoproducts (SPPs) are three-level network structures that give a good compromise between compact representation and small depth of the resulting circuit. In this paper the testability of circuits derived from SPPs is studied. For SPPs several restricted forms can be considered. While full testability can be proved for some classes, others are shown to contain redundancies. Experiment...
متن کاملOn the testability of iterative logic arrays
The problem of detecting single cellular faults in arbitrarily large one-dimensional, unilateral, combi-national iterative logic arrays (= ILAs) is considered. Fault patterns (= FPs) of the ILA's basic cell are introduced to characterize any cellular fault. Testability properties like (full, partial) testability, redundancy, test complexity of FPs are studied. Based on this analysis we prove th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2010
ISSN: 1474-6670
DOI: 10.3182/20100830-3-de-4013.00033